Quasi-ergodic Nonstationary Queues
نویسندگان
چکیده
∗Department of Mathematics, Technion-Israel Institute of Technology ∗∗Vologda State Pedagogical University and Vologda Scientific Coordinate Centre of CEMI RAS, Vologda, Russia email: [email protected] Received October 14, 2002 Evaluation of the rate of convergence of stochastic models, as time t → ∞, has been a subject of investigation by generations of probabilists. During the last two decades a remarkable progress was made regarding time -homogeneousMarkov chains, as a result of implementation and development of sophisticated techniques: coupling, logarithmic Sobolev inequalities, the Poincare inequality and its versions arising from the variational interpretation of eigenvalues, and duality. The above mentioned stream of nowadays research was motivated by new fields of applications, s.t. algorithms of Monte Carlo for simulation of Markov chains and enumeration algorithms in computers. There is also a growing interest in time-nonhomogeneous Markov chains, see for instance [1], [7], [9]; such chains model a variety of queuing systems. Our work is devoted to the estimation of the rate of convergence in different types of exponential convergence of nonhomogeneous queues. The main tool of our study is the method formulated by the second author in [10], [11] and subsequently developed and extended in a series of papers [4]-[6] written by the authors of the present paper. The method is based on tw logarithmic norm of a linear operator function and a special transformation of the reduced matrix of intensities of the considered Markov chain. In the present study we apply the method to a class of Markov queues with a special form of nonhomogenuity that is common in applications. We want to mention that the initial motivation for the method considered came from B. V. Gnedenko [2], [3] and V. V. Kalashnikov [8]. The present research is the continuation of [4]-[6]. We deal with the class of nonhomogeneous birth and death processes (BDP) with intensities λn(t) = λna(t), μn(t) = μnb(t), t ≥ 0, n ≤ N where μ0 = 0, λn > 0, n = 0, . . . , N − 1, μn > 0, n = 1, . . . , N − 1.We suppose that there exist the limits
منابع مشابه
Nonstationary Erlang Loss Queues and Networks
ALNOWIBET, KHALID ABDULAZIZ Nonstationary Erlang Loss Queues and Networks. (Under the direction of Dr. Harry Perros) The nonstationary Erlang loss model is a queueing system consisting of a finite number of servers and no waiting room with a nonstationary arrival process or a time-dependent service rate. The Erlang loss model is commonly used to model and evaluate many communication systems. Of...
متن کاملA Mean Ergodic Theorem For Asymptotically Quasi-Nonexpansive Affine Mappings in Banach Spaces Satisfying Opial's Condition
متن کامل
A Simple Approximation for Modeling Nonstationary Queues
Evaluation of the behavior of queues with nonsta-tionary arrival processes is of importance in several applications including communication networks. However , the analysis of nonstationary queues is in general computationally complex, and seldom produces closed form expressions. Thus approximation methods may be more appropriate. In this paper, the pointwise stationary uid ow approximation (PS...
متن کاملUnstable Asymptomatics for Nonstationary Queues
We relate laws of large numbers and central limit theorems for nonstationary counting processes to corresponding limits for their inverse processes. We apply these results to develop approximations for queues that are unstable in a nonstationary manner. We obtain unstable nonstationary analogs of the queueing relation L = λW and associated central-limit-theorem versions. For modeling and to obt...
متن کامل